On the multiplying ability of two-way automata

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the effect of learning strategies on the speaking ability of iranian students in the context of language institutes

the effect of learning strategies on the speaking ability of iranian students in the context of language institutes abstract language learning strategies are of the most important factors that help language learners to learn a foreign language and how they can deal with the four language skills specifically speaking skill effectively. acknowledging the great impact of learning strategies...

The Reduction of Two-Way Automata to One-Way Automata

We describe a new elementary reduction of two-way automata to one-way automata. The reduction is based on the subset construction rather than on crossing sequence analysis.

متن کامل

the effect of consciousness raising of sociolinguistic skills on speaking ability of iranian efl learners

abstract the main purpose of this study was to investigate whether there was any significant difference between the speaking achievement of learners who were trained by means of consciousness raising of sociolinguistic skills and that of learners who were trained without the above mentioned task. the participants of this study consist of 60 intermediate level students participating languag...

Two-Way Two-Tape Automata

In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for non-unary alphabets. This improves a similar result of Kari and Moore for picture languages. We also show that these deterministic, non-deterministic and alterna...

متن کامل

Tropical Two-Way Automata

In this paper we study two-way min-plus automata. We prove that two-way distance automata are equivalent to one-way distance automata. In the second part of the paper we show that, with general min-plus semirings, it is decidable whether every accepted word has a weight different from −∞ and that, in contrast, it is undecidable whether there exists a word accepted with a weight different from −∞.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1968

ISSN: 0022-0000

DOI: 10.1016/s0022-0000(68)80036-4